Plan Projection as Deduction and Plan Generation as Abduction in a Context-sensitive Temporal Probability Logic
نویسندگان
چکیده
This paper presents a theoretical framework for representing plans in a context-sensitive temporal probability logic and for reasoning about plans by constructing Bayesian networks from these knowledge bases. We provide a sound and complete network construction algorithm for evaluating plans which uses context information to index only the relevant portions of the knowledge base. We formalize plan generation as a process of abduction in our language and provide a sound and complete anytime plan generation algorithm. We show that the provided framework is capable of representing a wide range of previously proposed probabilistic action models.
منابع مشابه
A Theoretical Framework for Context-Sensitive Temporal Probability Model Construction with Application to Plan Projection
We define a context-sensitive temporal prob ability logic for representing classes of discrete-time temporal Bayesian networks. Context constraints allow inference to be focused on only the relevant portions of the probabilistic knowledge. We provide a declarative semantics for our language. We present a Bayesian network construction algorithm whose generated networks give sound and complete a...
متن کاملBayesian Abductive Logic Programs: A Probabilistic Logic for Abductive Reasoning
In this proposal, we introduce Bayesian Abductive Logic Programs (BALP), a probabilistic logic that adapts Bayesian Logic Programs (BLPs) for abductive reasoning. Like BLPs, BALPs also combine first-order logic and Bayes nets. However, unlike BLPs, which use deduction to construct Bayes nets, BALPs employ logical abduction. As a result, BALPs are more suited for problems like plan/activity reco...
متن کاملDeductive Approaches to Plan Generation and Plan Recognition
Terminological Plan Recognition Diane Litman, AT&T Bell Laboratories, USA Description logics are widely used in AI to construct concept taxonomies based on subsumption inferences. However, current description logics are unable to handle complex compositions of concepts, for example constraint networks where each node is described by an associated concept. Plans can be thought of as constraint n...
متن کاملOn the Computational Complexity of Temporal Projection and Plan Validation
One kind of temporal reasoning is temporal projection|the computation of the consequences of a set of events. This problem is related to a number of other temporal reasoning tasks such as story understanding, planning, and plan validation. We show that one particular simple case of temporal projection on partially ordered events turns out to be harder than previously conjectured. However, given...
متن کاملBayesian inference for statistical abduction using Markov chain Monte Carlo
Abduction is one of the basic logical inferences (deduction, induction and abduction) and derives the best explanations for our observation. Statistical abduction attempts to define a probability distribution over explanations and to evaluate them by their probabilities. The framework of statistical abduction is general since many well-known probabilistic models, i.e., BNs, HMMs and PCFGs, are ...
متن کامل